On Lagrange multipliers of trust-region subproblems
نویسندگان
چکیده
منابع مشابه
On solving L-SR1 trust-region subproblems
In this article, we consider solvers for large-scale trust-region subproblems when the quadratic model is defined by a limited-memory symmetric rank-one (L-SR1) quasi-Newton matrix. We propose a solver that exploits the compact representation of L-SR1 matrices. Our approach makes use of both an orthonormal basis for the eigenspace of the L-SR1 matrix and the ShermanMorrison-Woodbury formula to ...
متن کاملOn solving trust-region and other regularised subproblems in optimization
The solution of trust-region and regularisation subproblems which arise in unconstrained optimization is considered. Building on the pioneering work of Gay, Moré and Sorensen, methods which obtain the solution of a sequence of parametrized linear systems by factorization are used. Enhancements using high-order polynomial approximation and inverse iteration ensure that the resulting method is bo...
متن کاملIndefinite Trust Region Subproblems and Nonsymmetric Eigenvalue Perturbations
1 This paper extends the theory of trust region subproblems in two ways: (i) it allows indeenite inner products in the quadratic constraint and (ii) it uses a two sided (upper and lower bound) quadratic constraint. Characterizations of optimality are presented, which have no gap between necessity and suuciency. Conditions for the existence of solutions are given in terms of the deeniteness of a...
متن کاملSecond-Order-Cone Constraints for Extended Trust-Region Subproblems
The classical trust-region subproblem (TRS) minimizes a nonconvex quadratic objective over the unit ball. In this paper, we consider extensions of TRS having extra constraints. When two parallel cuts are added to TRS, we show that the resulting nonconvex problem has an exact representation as a semidefinite program with additional linear and second-order-cone constraints. For the case where an ...
متن کاملOn the Method of Lagrange Multipliers
and there are no inequality constraints (i.e. there are no fi(x) i = 1, . . . , m). We simply write the p equality constraints in the matrix form as Cx− d = 0. The basic idea in Lagrangian duality is to take the constraints in (1) into account by augmenting the objective function with a weighted sum of the constraint functions. We define the Lagrangian L : R ×R ×R → R associated with the proble...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: BIT Numerical Mathematics
سال: 2008
ISSN: 0006-3835,1572-9125
DOI: 10.1007/s10543-008-0197-5